OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
نویسندگان
چکیده
منابع مشابه
Global optimization method for solving the minimum maximal flow problem
The problem of minimizing the flow value attained by maximal flows plays an important and interesting role to investigate how inefficiently a network can be utilized. It is a typical multiextremal optimization problem, which can have local optima different from global optima. We formulate this problem as an global optimization problem with a special structure and propose a method to combine dif...
متن کاملAn Outer Approximation Method for the Variational Inequality Problem
We study two outer approximation schemes, applied to the variational inequality problem in reflexive Banach spaces. First we pro∗Research of this author was supported by CAPES Grant BEX 0664-02/2. †Partially supported by PICDT/UFPI-CAPES ‡Partially supported by CNPq Grant 301200/93-9(RN) and by PRONEX– Optimization.
متن کاملAn outer approximation method for the road network design problem
Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybri...
متن کاملMinimum Maximal Flow Problem: An Optimization over the Efficient Set
The network flow theory and algorithms have been developed on the assumption that each arc flow is controllable and we freely raise and reduce it. We however consider in this paper the situation where we are not able or allowed to reduce the given arc flow. Then we may end up with a maximal flow depending on the initial flow as well as the way of augmentation. Therefore the minimum of the flow ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2007
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.50.14